An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
نویسندگان
چکیده
Related DatabasesWeb of Science You must be logged in with an active subscription to view this.Article DataHistorySubmitted: 14 February 2019Accepted: 10 June 2021Published online: 28 October 2021Keywordssemidefinite programs, storage optimality, low rank, complementary slackness, primal recoveryAMS Subject Headings90C06, 90C22, 49M05Publication DataISSN (print): 1052-6234ISSN (online): 1095-7189Publisher: Society for Industrial and Applied MathematicsCODEN: sjope8
منابع مشابه
Approximate maximum-likelihood estimation using semidefinite programming
We consider semidefinite relaxations of a quadratic optimization problem with polynomial constraints. This is an extension of quadratic problems with boolean variables. Such combinatorial problems can in general not be solved in polynomial time. Semidefinite relaxations has been proposed as a promising technique to give provable good bounds on certain boolean quadratic problems in polynomial ti...
متن کاملA semidefinite programming approach to optimal unambiguous discrimination of quantumstates
In this paper we consider the problem of unambiguous discrimination between a set of linearly independent pure quantum states. We show that the design of the optimal measurement that minimizes the probability of an inconclusive result can be formulated as a semidefinite programming problem. Based on this formulation, we develop a set of necessary and sufficient conditions for an optimal quantum...
متن کاملOptimal Day-Ahead Trading and Storage of Renewable Energies - An Approximate Dynamic Programming Approach
A renewable power producer who trades on a day-ahead market sells electricity under supply and price uncertainty. Investments in energy storage mitigate the associated financial risks and allow for decoupling the timing of supply and delivery. This paper introduces a model of the optimal bidding strategy for a hybrid system of renewable power generation and energy storage. We formulate the prob...
متن کاملSublinear time algorithms for approximate semidefinite programming
We consider semidefinite optimization in a saddle point formulation where the primal solution is in the spectrahedron and the dual solution is a distribution over affine functions. We present an approximation algorithm for this problem that runs in sublinear time in the size of the data. To the best of our knowledge, this is the first algorithm to achieve this. Our algorithm is also guaranteed ...
متن کاملSemidefinite Programming Approach to Russell Measure Model
Throughout its evolution, data envelopment analysis (DEA) has mostly relied on linear programming, particularly because of simple primal-dual relations and the existence of standard software for solving linear programs. Although also nonlinear models, such as Russell measure or hyperbolic measure models, have been introduced, their use in applications has been limited mainly because of their co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Siam Journal on Optimization
سال: 2021
ISSN: ['1095-7189', '1052-6234']
DOI: https://doi.org/10.1137/19m1244603